Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs

This paper studies a real-time parking-sharing program with which owners of private parking spaces can lend out their to other drivers park when these are not in use. Compared curbside and garage problems, the information supplies demands is randomly announced by respectively via APP installed on smartphones. Besides, made available independent usually heterogeneous terms locations time intervals. Thus, two critical issues need be resolved: (a) appropriately matching under an uncertain setting; (b) efficiently scheduling matched avoid potential conflicts. We propose novel reservation approach based rolling-horizon framework, assign multiple single space order better utilize scarce resources. For each period, integrated optimal matching-and-scheduling problem formulated as mixed integer programming model proved strongly NP-hard. To fast generate near-optimal solution problem, two-stage heuristics derived from minimum-cost flow developed. The computational results validate efficiency effectiveness proposed approach. Some operational insights also presented discussed.